On Finite Time Delay Dependent Stability of Linear Discrete Delay Systems: Numerical Solution Approach

In this paper, a possible solution of the basic nonlinear quadratic matrix equation was proposed. The solution is crucial in the formulation of the particular criteria for the delay-dependent finite time stability of discrete time delay systems represented as x(k+1) = A0(k) + A1x(k–h). The time delay-dependent criteria have been derived. In addition, the significance of the nonlinear discrete polynomial matrix equation is explained. With the use of the mathematical formalism based on the Traub and Bernoulli’s algorithms, it was concluded that the computation of the dominant solvent of the matrix polynomial equation does not guarantee a necessary convergence in all cases, unlike in the traditional numerical procedures. In this paper, we presented one particular and one general solution valid in the case when the discrete matrix equation was presented in its factorial form. The numerical computations are performed to illustrate the suggested results.